منابع مشابه
Approximating the Maxmin-angle Covering Triangulation
Given a planar straight line graph we seek a covering triangulation whose minimumangle is as large as possible A covering triangulation is a Steiner triangulation with the following restriction No Steiner vertices may be added on an input edge We give an explicit upper bound on the largest possible minimum angle in any covering triangulation of a given input This upper bound depends only on loc...
متن کاملFinding a Covering Triangulation Whose Maximum Angle is Provably Small
We consider the following problem given a pla nar straight line graph nd a covering triangulation whose maximum angle is as small as possible A cov ering triangulation is a triangulation whose vertex set contains the input vertex set and whose edge set con tains the input edge set The covering triangulation problem di ers from the usual Steiner triangulation problem in that we may not add a ver...
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90213-x